Designing Reliable Distributed Systems by Peter Csaba Ölveczky

Author:Peter Csaba Ölveczky
Language: eng
Format: epub
Publisher: Springer London, London

cannot be determined by just computing “normal forms.” Maude must search (in a breadth-first way) all computation paths from (the instance of) u to check if (the corresponding instance of) can be reached. If cannot be reached from u, Maude might search forever just to determine whether the rule can be applied!

9.2 Simulating Single Behaviors

Maude’s rew and frew commands are used to execute a single behavior of a system. These commands apply rewrite rules to perform one-step sequential rewrites until no rule can be applied, or until a user-given bound on the number of rewrites has been reached. The execution could go on forever if the specification is nonterminating and the user does not provide an upper bound on the number of rewrites.

Since each term is reduced to its E-normal form before a rewrite rule is applied, a finite Maude execution with the rew or frew command has the form

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.